The global minimum is the point in a {[search space}} or {[fitness landsape}} with the lowest possible value. When a low score is good, the global minimum is the optimal solution. It is in contrast to a local minimum, that is a point in the search space that is smaller than any of its neighbours, but not necessarily smallest overall.
Used on Chap. 4: pages 71, 76